Question-Generation in Constraint-Based Expert Systems

نویسندگان

  • James Bowen
  • Chavalit Likitvivatanavong
چکیده

If-then rules are the core knowledge representation technology in currently deployed expert systems. However, if we replace rules by constraints, we can greatly extend both the expressive and reasoning functionality of such systems. An open issue, however, is how best should constraint-based expert systems decide which questions to ask their users during a consultation – how can an interactive constraint-based expert system extract needed data from its users while imposing the smallest possible burden on those users. In this paper we consider three types of approach to the task.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint-Based Random Stimuli Generation for Hardware Verification

We report on random stimuli generation for hardware verification in IBM as a major application of various artificial intelligence technologies, including knowledge representation, expert systems, and constraint satisfaction. The application has been developed for almost a decade, with huge payoffs. Research and development around this application is still thriving, as we continue to cope with t...

متن کامل

NSAIL: Behavioural Sailing Animation Using Constraint-Based Reasoning

Behaviour is a reflection of a reasoning process that must deal with constraints imposed by an external environment, internal knowledge and physical structure. This paper proposes a framework for behavioural animation that is based on the next generation of object-oriented, constraint-based expert systems technology, and applies a control structure of knowledge agents and knowledge units to det...

متن کامل

Towards Literate Artificial Intelligence

Standardized tests are often used to test students as they progress in the formal education system. These tests are widely available and measurable with clear evaluation procedures and metrics. Hence, these can serve as good tests for AI. We propose approaches for solving some of these tests. We broadly categorize these tests into two categories: open domain question answering tests such as rea...

متن کامل

A Reasoning Methodology for CW-Based Question Answering Systems

Question Answering Systems or (QA systems for short) are regarded as the next generation of the current search engines. Instead of returning a list of relevant documents, QA systems find the direct answer to the query posed in natural language. The key difficulty in designing such systems is to perform reasoning on natural language knowledge base. The theory of Computing with Words (CW), propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002